Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices

نویسندگان

  • Matthias Beck
  • Serkan Hoşten
چکیده

The coordination sequence of a lattice L encodes the word-length function with respect toM , a set that generates L as a monoid. We investigate the coordination sequence of the cyclotomic lattice L = Z[ζm], where ζm is a primitive m th root of unity and where M is the set of all m roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function of the coordination sequence; this structure depends on the prime factorization of m. Our methods are based on unimodular triangulations of the m cyclotomic polytope, the convex hull of the m roots of unity in R.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computations of Cyclotomic Lattices

We study even modular lattices of leveì and dimension 2(p ? 1), p prime, which arise from the ideal class group of the p-th cyclotomic extension of Q(p ?`). After giving the basic theory we concentrate on Galois-invariant ideals , obtain computational results on minimal vectors and isometries, and identify several old or new extremal lattices.

متن کامل

Cyclotomic and Simplicial Matroids

We show that two naturally occurring matroids representable over Q are equal: the cyclotomic matroid μn represented by the n roots of unity 1, ζ, ζ, . . . , ζ inside the cyclotomic extension Q(ζ), and a direct sum of copies of a certain simplicial matroid, considered originally by Bolker in the context of transportation polytopes. A result of Adin leads to an upper bound for the number of Q-bas...

متن کامل

Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings

Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is called principle ideal problem (PIP). Its goal is to find a generators of any principle ide...

متن کامل

Polynomial Time Reduction from Approximate Shortest Vector Problem to Principal Ideal Problem for Lattices in Some Cyclotomic Rings

Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is the principal ideal problem (PIP). Its goal is to find a generator of any principal ideal i...

متن کامل

Provably Secure NTRUEncrypt over More General Cyclotomic Rings

NTRUEncrypt is a fast and standardized lattice-based public key encryption scheme, but it lacks a solid security guarantee. In 2011, Stehlé and Steinfeld first proposed a provably secure variant of NTRUEncrypt, denoted by pNE, over power-of-2 cyclotomic rings. The IND-CPA security of pNE is based on the worst-case quantum hardness of classical problems over ideal lattices. Recently, Yu, Xu and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006